#include <bits/stdc++.h>
using namespace std;

long long n, a[100007], r[100007], dl_f;

int main(){
	freopen("duel.in", "r", stdin);
	freopen("duel.out", "w", stdout);
	scanf("%lld", &n);
	for(int i = 1; i <= n; i++){
		scanf("%lld", &a[i]);
		r[a[i]]++;
	}
	for(int i = 1; i <= 100000; i++){
		if(r[i] > dl_f){
			dl_f = r[i];
		}
	}
	printf("%lld\n", dl_f);
	return 0;
}
